EBIC: an evolutionary-based parallel biclustering algorithm for pattern discovery

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EBIC: an artificial intelligence-based parallel biclustering algorithm for pattern discovery

In this paper a novel biclustering algorithm based on artificial intelligence (AI) is introduced. The method called EBIC aims to detect biologically meaningful, order-preserving patterns in complex data. The proposed algorithm is probably the first one capable of discovering with accuracy exceeding 50% multiple complex patterns in real gene expression datasets. It is also one of the very few bi...

متن کامل

Pareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

متن کامل

A Parallel Evolutionary Algorithm for Discovery of Decision Rules

In the paper a new parallel method for learning decision rules is proposed. The method uses evolutionary algorithm to discover decision rules from datasets. We describe a parallelization of the algorithm based on master-slave model. In our approach the dataset is distributed among slave processors of a parallel system. The slave procesors compute fitness function of chromosomes in parallel. The...

متن کامل

An Evolutionary Trend Discovery Algorithm Based on Cubic Spline Interpolation

The speed of evolution, measured by the number of mutations over a fixed number of years, varies greatly in various branches of the evolutionary tree. This paper proposes an evolutionary trend discovery algorithm that reveals the distinguishing characteristics of any branch of the evolutionary tree. The evolutionary trend discovery algorithm is designed to work with either fossil-based data or ...

متن کامل

Hypergraph based geometric biclustering algorithm

0167-8655/$ see front matter 2012 Elsevier B.V. A http://dx.doi.org/10.1016/j.patrec.2012.05.001 ⇑ Corresponding author. E-mail addresses: [email protected] gmail.com (C.W. Yu), [email protected] (R.C.C. (H. Yan). In this paper, we present a hypergraph based geometric biclustering (HGBC) algorithm. In a high dimensional space, bicluster patterns to be recognized can be considered...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bioinformatics

سال: 2018

ISSN: 1367-4803,1460-2059

DOI: 10.1093/bioinformatics/bty401